A Web based Course Scheduler in Constraint Logic Programming: Interactive Computing with Constraints

نویسندگان

  • B. M. Lawal
  • D. R. Gilbert
  • A. A. Letichevsky
چکیده

This paper describes the design of a web based scheduler program and its implementation in the constraint logic programming language clp(FD). We give a formal description of this implementation using the interaction semantics of action languages recently developed by the authors. The clp code employs a port of the PiLLoW library and was compiled via C to executable code (using technology based on wamcc for Prolog) to be run as a CGI script. The implementation is based on the course modules description currently being used in the School of Informatics at City University. It integrates constraints concerning module pre-and post-requisites as described in the course guide, and computes a schedule for course modules to be run for 1st, 2nd and 3rd year BSc students. The paper also explores issues involved in programming in logic languages on the web, and shows that CLP can ooer an attractive environment for developing applications which can be delivered over the Internet/Intranet.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint-based Error Diagnosis in Logic Programming

Using the constraint-based modeling approach, we have developed a diagnostic component, which is able to identify errors made by learners of a logic programming language when implementing a given task specification. It uses patterns to hypothesize the intention of a learner and programming techniques to model conditions on the semantic well-formedness of the program code. These conditions are e...

متن کامل

Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints

The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

متن کامل

A Genetic-Algorithm-Based Reconfigurable Scheduler

Scheduling problems vary widely in the nature of their constraints and optimization criteria. Most scheduling algorithms make restrictive assumptions about the constraints and criteria and hence are applicable to only a limited set of scheduling problems. A reconfigurable scheduler is one that, unlike most schedulers, is easily configured to handle a wide variety of scheduling problems with dif...

متن کامل

Tutorial of Constraint Programming

Constraint programming, different from imperative and functional programing, is a declarative paradigm in which the programs or the problems are specified using a set of constraints instead of an algorithm. Programmers need not to describe how to solve the constraints. A general constraint solver will do this. A good example under this paradigm is logic computing. This scenario reflects the hig...

متن کامل

Enhancements to the Ground ProcessingScheduling SystemJuan

This paper describes work in progress to enhance the performance of the Ground Processing Scheduling System (GPSS). The GPSS is a constraint-based scheduler that deals with three kinds of constraints: temporal, resource, and connguration. It starts with a complete schedule that may have some constraint violations (connicts) and gradually improves the schedule by reducing the violations. The obj...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997